/*
A basic map for our search, each node has a parent and list of children node
I thought an array list would be nice because is provides a handy implementation,
but it could cause problems with memory if the problem gets really big.
*/
public class SearchMap 
{
	Node root;
	public class Node
    {
		public Node parent;
		public ArrayList<Node> tas;
           
        //Constructor
        //Every time a new node is made it is paired with a parent and given a new list of children.
        public Node (Node p)
		{
			 	tas = new ArrayList<Node>();
				parent = p;
		}
	}

	public void populateKidz (ArrayList list)
	{
		int counter = 0;
		while(counter < list.size())
		{
			if (list.get(counter).)
		}
	}		
}